Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance
نویسندگان
چکیده
منابع مشابه
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model
Consider the complete n-graph with independent exponential (mean n) edge-weights. Let M (c; n) be the maximal size of subtree for which the average edge-weight is at most c. It is shown that M (c; n) transitions from o(n) to (n) around some critical value c(0), which can be speciied in terms of a xed point of a mapping on probability distributions .
متن کاملA Tractable Complex Network Model Based on the Stochastic Mean-Field Model of Distance
Much recent research activity has been devoted to empirical study and theoretical models of complex networks (random graphs) possessing three qualitative features: power-law degree distributions, local clustering, and slowly-growing diameter. We point out a new (in this context) platform for such models – the stochastic mean-field model of distances – and within this platform study a simple two...
متن کاملWeak disorder asymptotics in the stochastic mean-field model of distance
In the recent past, there has been a concerted effort to develop mathematical models for real-world networks and analyze various dynamics on these models. One particular problem of significant importance is to understand the effect of random edge lengths or costs on the geometry and flow transporting properties of the network. Two different regimes are of great interest, the weak disorder regim...
متن کاملPercolation-like Scaling Exponents for Minimal Paths and Trees in the Stochastic Mean Field Model
In the mean field (or random link) model there are n points and inter-point distances are independent random variables. For 0 < l < ∞ and in the n → ∞ limit, let δ(l) = 1/n× (maximum number of steps in a path whose average step-length is ≤ l). The function δ(l) is analogous to the percolation function in percolation theory: there is a critical value l∗ = e −1 at which δ(·) becomes non-zero, and...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2017
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548317000220